A Hybrid of Variable Neighbor Search and Fuzzy Logic for the permutation flowshop scheduling problem with predictive maintenance
نویسندگان
چکیده
منابع مشابه
A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem
This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attent...
متن کاملA Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...
متن کاملSolving a hybrid flowshop scheduling problem with a decomposition technique and a fuzzy logic based method
We are interested in this paper in solving a multiobjective hybrid flowshop scheduling problem (HFS). The problem has different parameters and constraints such as release dates, due dates and sequence dependent setup times. Two different objectives should be optimized at once: the makespan and the total tardiness to be minimized. To solve the problem, we have developed two versions of a new dec...
متن کاملThe distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of identical factories or shops, each one with machines disposed in series. A set of n available jobs have to be distributed among the factories and then ...
متن کاملA hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem
In this paper we propose PSO–EDA, a hybrid particle swarm optimization (PSO) with estimation of distribution algorithm (EDA) to solve permutation flowshop scheduling problem (PFSP). PFSP is an NP-complete problem, for which PSO was recently applied. The social cognition in the metaphor of canonical PSO is incomplete, since information conveyed in the non-gbest particles is lost. Also, the intel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2017
ISSN: 1877-0509
DOI: 10.1016/j.procs.2017.08.120